Projected Gradient Flows for BV/Level Set Relaxation
نویسندگان
چکیده
منابع مشابه
Projected Gradient Flows for BV / Level Set Relaxation
This paper introduces a new level set method based on projected gradient flows for problems that can be solved by a recently introduced relaxation approach. For the class of problems the relaxation is exact, it can be shown that the solution of the flow converges to a solution of the relaxed problem for large time, and the level sets of the limit are solutions of the original problem. We introd...
متن کاملSemidefinite relaxation for dominating set
‎It is a well-known fact that finding a minimum dominating set and consequently the domination number of a general graph is an NP-complete problem‎. ‎In this paper‎, ‎we first model it as a nonlinear binary optimization problem and then extract two closely related semidefinite relaxations‎. ‎For each of these relaxations‎, ‎different rounding algorithm is exp...
متن کاملA Projected Gradient Algorithm for Solving the Maxcut Sdp Relaxation∗
In this paper, we develop a specialized algorithm for solving the semidefinite programming (SDP) relaxation of the maximum cut (maxcut) problem. The maxcut problem has many applications, e.g., in VLSI design and statistical physics (see [2, 4, 5, 19, 21]). Several algorithms have been proposed to find either exact or approximate solutions to this problem. As for many combinatorial optimization ...
متن کاملSpectral Projected Gradient Methods
The poor practical behavior of (1)-(2) has been known for many years. If the level sets of f resemble long valleys, the sequence {xk} displays a typical zig-zagging trajectory and the speed of convergence is very slow. In the simplest case, in which f is a strictly convex quadratic, the method converges to the solution with a Q-linear rate of convergence whose factor tends to 1 when the conditi...
متن کاملProjected Gradient Methods for Nonnegative Matrix Factorization
Nonnegative matrix factorization (NMF) can be formulated as a minimization problem with bound constraints. Although bound-constrained optimization has been studied extensively in both theory and practice, so far no study has formally applied its techniques to NMF. In this letter, we propose two projected gradient methods for NMF, both of which exhibit strong optimization properties. We discuss ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: PAMM
سال: 2005
ISSN: 1617-7061,1617-7061
DOI: 10.1002/pamm.200510004